First-order satisfiability in Gödel logics: an NP-complete fragment Matthias Baaza,1 , Agata Ciabattonia,2 , Norbert Preininga,b,3 a b

Source URL: www.preining.info

• Logic
• Mathematical logic
• Abstraction
• Model theory
• Non-classical logic
• Logic in computer science
• Predicate logic
• First-order logic
• Boolean satisfiability problem
• Gdel numbering
• Many-valued logic
• Kripke semantics

Optimal Dynamic Partial Order Reduction Parosh Abdulla Stavros Aronis Bengt Jonsson

Source URL: user.it.uu.se

• Theoretical computer science
• Algorithm
• Mathematical logic
• Mathematics
• ReedSolomon error correction
• Discrete mathematics
• Formal methods

Towards a Proof Theory for Multi-Agent Logics with Irrevocable Strategies 1 ˚ Thomas Agotnes , Valentin Goranko2 , and Wojciech Jamroga3

Source URL: folk.uib.no

• Logic
• Mathematical logic
• Philosophy
• Model theory
• Formal languages
• Logical truth
• Propositional calculus
• Linear temporal logic
• Temporal logic
• Interpretation
• Substitution
• operator

TABLEAUX 2011 Workshops, Tutorials, and Short Papers Martin Giese and Roman Kuznets (editors) Technical Report IAM, 4–8 JulyInstitut fur

Source URL: www.tableaux11.unibe.ch

• Logic
• Mathematical logic
• Theoretical computer science
• Automated theorem proving
• Proof theory
• Methods of proof
• International Workshop on First-Order Theorem Proving
• Melvin Fitting
• Natural deduction
• Sequent calculus
• Modal logic
• Method of analytic tableaux

Geometry with Proof Logic Note #1 Period:______ Name: _________________________ A mathematical sentence states a fact or contains a complete idea. Some sentences have uncertain TURTH VALUES, while others are found

Source URL: www.apcomputerscience.com

A Logic of Reasoning, Communication and Cooperation with Syntactic Knowledge Thomas ˚ Agotnes Michal Walicki

Source URL: folk.uib.no

• Logic
• Mathematical logic
• Philosophy
• Formal epistemology
• Modal logic
• Artificial intelligence
• Belief
• Epistemic modal logic
• Non-classical logic
• Logic programming
• Epistemic closure
• FO

C:/Documents and Settings/jipsen/My Documents/Classes/Math Club/settheoryaxioms.dvi

Source URL: math.chapman.edu

• Mathematical logic
• Mathematics
• Logic
• Z notation
• Foundations of mathematics
• ZermeloFraenkel set theory
• Axioms of set theory
• Constructible universe
• S
• TarskiGrothendieck set theory
• MorseKelley set theory

Sunday, 21 9:00-10:00 10:00-10:30 10:30-10:55 10:55-11:20 11:20-11:45

Source URL: logica.dmi.unisa.it

• Logic
• Mathematics
• Algebra
• Fuzzy logic
• Non-classical logic
• Lattice theory
• Mathematical logic
• Algebraic logic
• Monoidal t-norm logic
• BL
• Residuated lattice
• MV-algebra

Abstract interpretation of probabilistic semantics David Monniaux http://www.di.ens.fr/~monniaux LIENS, 45 rue d’UlmParis cedex 5, France

Source URL: www-verimag.imag.fr

• Theoretical computer science
• Mathematics
• Mathematical logic
• Logic in computer science
• Programming language semantics
• Measure theory
• Boolean algebra
• Probability theory
• Denotational semantics
• Predicate transformer semantics
• Sigma-algebra
• PP

Knowing Minimum/Maximum n Formulae 1 and Natasha Alechina 2 ˚ Thomas Agotnes Abstract. We introduce a logical language with nullary operators min(n), for each non-negative integer n, which mean ‘the reasoner has at l

Source URL: folk.uib.no

• Logic
• Mathematical logic
• Abstraction
• Model theory
• Formal languages
• Logical truth
• Metalogic
• First-order logic
• Interpretation
• Substitution
• Well-formed formula
• Satisfiability